Product Code Database
Example Keywords: tie -ink $61-188
   » » Wiki: Moni Naor
Tag Wiki 'Moni Naor'.
Tag

Moni Naor
 (

 C O N T E N T S 
Rank: 100%
Bluestar Bluestar Bluestar Bluestar Blackstar

Moni Naor () is an computer scientist, currently a professor at the Weizmann Institute of Science. Naor received his Ph.D. in 1989 at the University of California, Berkeley. His advisor was .

He works in various fields of , mainly the foundations of . He is notable for initiating research on public key systems secure against chosen ciphertext attack and creating non-malleable cryptography, visual cryptography (with ), and suggesting various methods for verifying that users of a computer system are human (leading to the notion of ). His research on Small-bias sample space, give a general framework for combining small k-wise independent spaces with small \epsilon-biased spaces to obtain \delta-almost k-wise independent spaces of small size. In 1994 he was the first, with , to formally study the problem of practical broadcast encryption.

(1994). 9783540577669 .
Along with , Amos Fiat, and Benny Pinkas, he made a contribution to the development of , a copyright infringement detection system which works by tracing the source of leaked files rather than by direct .


Bibliography
  • Cynthia Dwork, Jeff Lotspiech and Moni Naor, Digital Signets: Self-Enforcing Protection of Digital Information.
  • Dalit Naor, Moni Naor and Jeff Lotspiech, Revocation and Tracing Schemes for Stateless Receivers.
  • David Chaum, Amos Fiat and Moni Naor, Untraceable Electronic Cash, 1990 .
    (1990). 9780387971964, Springer New York.
  • Amos Fiat and Moni Naor, Implicit O(1) Probe Search, SIAM J. Computing 22: 1-10 (1993).
  • Amos Fiat and Moni Naor, Broadcast Encryption, 1994 .
    (1994). 9783540577669 .
  • Moni Naor and Benny Pinkas, Threshold Traitor Tracing, Crypto 98.
  • Moni Naor and Benny Pinkas, Efficient Trace and Revoke Schemes, FC'2000.
  • Benny Chor, Amos Fiat, Moni Naor and Benny Pinkas, Tracing Traitors, IEEE Transactions on Information Theory, Vol. 46(3), pp. 893–910, 2000.


Honors and awards
  • 2008: Named an IACR fellow
  • 2014: The Gödel Prize (with co-authors)
  • 2016: The Paris Kanellakis Theory and Practice Award of the Association for Computing Machinery (with )
  • 2022: The 30-year Test-of-Time STOC Award for his 1991 STOC paper “Non-Malleable Cryptography” (with and )
  • 2022: RSA Award for Excellence in Mathematics (with )
  • 2024: Rothschild Prize in Computer Science for 2024 The Rothschild Prize


Sources

Page 1 of 1
1
Page 1 of 1
1

Account

Social:
Pages:  ..   .. 
Items:  .. 

Navigation

General: Atom Feed Atom Feed  .. 
Help:  ..   .. 
Category:  ..   .. 
Media:  ..   .. 
Posts:  ..   ..   .. 

Statistics

Page:  .. 
Summary:  .. 
1 Tags
10/10 Page Rank
5 Page Refs